Local Search Heuristics for k - median
نویسندگان
چکیده
In the k-median and facility location problems, we are given two sets: F , the set of facilities and C, the set of clients. There is a specified distance cij ≥ 0 (forming a metric) between every pair i, j ∈ F ∪C. The goal is to identify a subset of facilities S ⊆ F and to serve the clients in C by the facilities in S, such that the cost function is minimized. Formally, the k-median problem is defined as:
منابع مشابه
7.2.1 Introduction 17.2.1.1 Background for K-median and Facility Location Problems 17.2.1.2 Background for Local Search Heuristics
In this note, we will survey the local search heuristics for the metric k-median and facility location problems. We define the locality gap of a local search heuristics for a minimization problem as the maximum ratio of local optimal solution (produced by local search heuristics) to the global optimal solution. For k-median, the local search with single swap has a locality gap of 5. Moreover, i...
متن کاملA discrete particle swarm optimization algorithm with local search for a production-based two-echelon single-vendor multiple-buyer supply chain
This paper formulates a two-echelon single-producer multi-buyer supply chain model, while a single product is produced and transported to the buyers by the producer. The producer and the buyers apply vendor-managed inventory mode of operation. It is assumed that the producer applies economic production quantity policy, which implies a constant production rate at the producer. The operational pa...
متن کاملSimpler Analyses of Local Search Algorithms for Facility Location
We study local search algorithms for metric instances of facility location problems: the uncapacitated facility location problem (UFL), as well as uncapacitated versions of the k-median, k-center and kmeans problems. All these problems admit natural local search heuristics: for example, in the UFL problem the natural moves are to open a new facility, close an existing facility, and to swap a cl...
متن کاملIterated Local Search Algorithm for the Constrained Two-Dimensional Non-Guillotine Cutting Problem
An Iterated Local Search method for the constrained two-dimensional non-guillotine cutting problem is presented. This problem consists in cutting pieces from a large stock rectangle to maximize the total value of pieces cut. In this problem, we take into account restrictions on the number of pieces of each size required to be cut. It can be classified as 2D-SLOPP (two dimensional single large o...
متن کاملEPQ model with depreciation cost and process quality cost as continuous functions of time
Extensive research has been devoted to economic production quantity (EPQ) problem. However, little atten-tion has been paid to problems where depreciation cost and process quality cost must be considered, simulta-neously. In this paper, we consider the economic production quantity model of minimizing the annual total cost subject to depreciation cost and process quality cost, where depreciation...
متن کامل